منابع مشابه
An inverse-free ADI algorithm for computing Lagrangian invariant subspaces
The numerical computation of Lagrangian invariant subspaces of large scale Hamiltonian matrices is discussed in the context of the solution of Lyapunov and Riccati equations. A new version of the low-rank alternating direction implicit method is introduced, which in order to avoid numerical difficulties with solutions that are of very large norm, uses an inverse-free representation of the subsp...
متن کاملA Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...
متن کاملRiemannian Newton and conjugate gradient algorithm for computing Lagrangian invariant subspaces ∗
The computation of Lagrangian invariant subspaces of a Hamiltonian matrix, or the closely related task of solving algebraic Riccati equations, is an important issue in linear optimal control, stochastic control and H∞-design. We propose a new class of Riemannian Newton methods that allows to compute isolated Lagrangian invariant subspaces of a Hamiltonian matrix. The algorithm implements a vari...
متن کاملPerformance analysis of an adaptive algorithm for tracking dominant subspaces
This paper provides a performance analysis of a least mean square (LMS) dominant invariant subspace algorithm. Based on an unconstrained minimization problem, this algorithm is a stochastic gradient algorithm driving the columns of a matrix W to an orthonormal basis of a dominant invariant subspace of a correlation matrix. We consider the stochastic algorithm governing the evolution of WW to th...
متن کاملAn Augmented Lagrangian Algorithm for Solving Semiinfinite Programming
We present a smooth augmented Lagrangian algorithm for semiinfinite programming SIP . For this algorithm, we establish a perturbation theorem under mild conditions. As a corollary of the perturbation theorem, we obtain the global convergence result, that is, any accumulation point of the sequence generated by the algorithm is the solution of SIP.We get this global convergence result without any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1990
ISSN: 0024-3795
DOI: 10.1016/0024-3795(90)90303-t